Efficient quantization for average consensus

نویسندگان

  • Ruggero Carli
  • Fabio Fagnani
  • Paolo Frasca
  • Sandro Zampieri
چکیده

This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficient zooming-in/zooming-out quantization scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Source Coding Optimization for Distributed Average Consensus

PILGRIM, RYAN ZACHARY. Source Coding Optimization for Distributed Average Consensus. (Under the direction of Dror Baron.) Consensus is a common method for computing a function of the data distributed among the nodes of a network. Of particular interest is distributed average consensus, whereby the nodes iteratively compute the sample average of the data stored at all the nodes of the network us...

متن کامل

Rates of Convergence for Distributed Average Consensus with Probabilistic Quantization

Probabilistically quantized distributed averaging (PQDA) is a fully decentralized algorithm for performing average consensus in a network with finite-rate links. At each iteration, nodes exchange quantized messages with their immediate neighbors. Then each node locally computes a weighted average of the messages it received, quantizes this new value using a randomized quantization scheme, and t...

متن کامل

Average consensus with weighting matrix design for quantized communication on directed switching graphs

We study average consensus for directed graphs with quantized communication under fixed and switching topologies. In the presence of quantization errors, conventional consensus algorithms fail to converge and may suffer from an unbounded asymptotic mean square error. We develop robust consensus algorithms to reduce the effect of quantization. Specifically, we introduce a robust weighting matrix...

متن کامل

Distributed dynamic consensus under quantized communication data

Distributed dynamic average consensus is investigated under quantized communication data. We use a uniform quantizer with constant quantization step-size to deal with the saturation caused by the dynamic consensus error and propose a communication feedback-based distributed consensus protocol suitable for directed time-varying topologies to make the internal state of each agent’s encoder consis...

متن کامل

Average consensus on networks with quantized communication

This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation which is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0903.1337  شماره 

صفحات  -

تاریخ انتشار 2009